Improved worst-case complexity for the MIN 3-SET COVERING problem
نویسندگان
چکیده
منابع مشابه
Improved worst-case complexity for the MIN 3-SET COVERING problem
We consider min set covering when the subsets are constrained to have maximum cardinality three. We propose an exact algorithm whose worst case complexity is bounded above by O∗(1.3957n). This is an improvement, based on a refined analysis, of a former result (O∗(1.4492n)) by F. Della Croce and V. Th. Paschos, Computing optimal solutions for the min 3-set covering problem, Proc. ISAAC’05, LNCS ...
متن کاملImproved Greedy Algorithm for Set Covering Problem
This paper proposes a greedy algorithm named as Big step greedy set cover algorithm to compute approximate minimum set cover. The Big step greedy algorithm, in each step selects p sets such that the union of selected p sets contains greatest number of uncovered elements and adds the selected p sets to partial set cover. The process of adding p sets is repeated until all the elements are covered...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA New Worst-Case bound of heuristic for Set Covering Problem
This paper presents a new worst-case analysis of heuristic approach to solve the Set Covering Problem (SCP) which is NP-hard. In this analysis Worst-case complexity and upper bound of solving SCP using this approach are presented.
متن کاملa local branching approach for the set covering problem
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2007
ISSN: 0167-6377
DOI: 10.1016/j.orl.2006.02.004